Hypergraph Modeling
نویسندگان
چکیده
Abstract Hypergraph modeling is the fundamental task in hypergraph computation, which targets on establishing a high-quality structure to accurately formulate high-order correlation among data. In this section, we introduce different methods show how build hypergraphs using various pieces of information, such as features, attributes, and/or graphs. These are organized into two broad categories, depending whether these correlations explicit or implicit, distinguish similarities and differences. We then further discuss optimization generation methods, adaptive modeling, generative knowledge generation.
منابع مشابه
Networks of Collaborations: Hypergraph Modeling and Visualisation
The acknowledged model for networks of collaborations is the hypergraph model. Nonetheless when it comes to be visualized hypergraphs are transformed into simple graphs. Very often, the transformation is made by clique expansion of the hyperedges resulting in a loss of information for the user and in artificially more complex graphs due to the high number of edges represented. The extra-node re...
متن کاملModeling Discontinuous Constituents with Hypergraph Grammars
Discontinuous constituent are a frequent problem in natural language analyses. A constituent is called discontinuous if it is interrupted by other constituents. In German they can appear with separable verb prefixes or relative clauses in the Nachfeld. They can not be captured by a context–free Chomsky grammar. A subset of hypergraph grammars are string grammars where the result of a derivation...
متن کاملHypergraph-Based Modeling of Ad-Hoc Business Processes
Process models are usually depicted as directed graphs, with nodes representing activities and directed edges control flow. While structured processes with pre-defined control flow have been studied in detail, flexible processes including ad-hoc activities need further investigation. This paper presents flexible process graph, a novel approach to model processes in the context of dynamic enviro...
متن کاملModeling the web as a hypergraph to compute page reputation
In this work we propose a model to represent the web as a directed hypergraph (instead of a graph), where links connect pairs of disjointed sets of pages. The web hypergraph is derived from the web graph by dividing the set of pages into non-overlapping blocks and using the links between pages of distinct blocks to create hyperarcs. A hyperarc connects a block of pages to a single page, in orde...
متن کاملHypergraph Rewriting
In their pioneering paper [KB70], Knuth and Bendix showed that con uence (or, equivalently, the Church-Rosser property) is decidable for terminating term rewriting systems. It su ces to compute all critical pairs t s ! u of rewrite steps in which s is the superposition of the left-hand sides of two rules, and to check whether t and u reduce to a common term. This procedure is justi ed by the so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial intelligence: Foundations, theory, and algorithms
سال: 2023
ISSN: ['2365-3051', '2365-306X']
DOI: https://doi.org/10.1007/978-981-99-0185-2_4